Can Computer Understand and Solve Turkish Arithmetic Problems?
نویسنده
چکیده
Understanding is one of the most important research areas of Natural Language Processing. Problem solving is a way of realizing machine understanding. This paper presents a problem solver system which can understand and solve arithmetic problems in Turkish. There are three main phases of the system: morphology, syntax and semantic. The difference from other systems that is; data modeled as semantic networks in semantic analysis. This type of modeling realized correct and fast understanding by reducing unnecessary data. Many of school mathematics problems can be solved by this model in Turkish Language. Performance of the system is analyzed by corresponding system’s performance and primary school students’ through selected problems. The system is enabling generate correct answers and necessary messages in a user friendly interface.
منابع مشابه
A New Approach to Solve N-Queen Problem with Parallel Genetic Algorithm
Over the past few decades great efforts were made to solve uncertain hybrid optimization problems. The n-Queen problem is one of such problems that many solutions have been proposed for. The traditional methods to solve this problem are exponential in terms of runtime and are not acceptable in terms of space and memory complexity. In this study, parallel genetic algorithms are proposed to solve...
متن کاملHesitant Fuzzy Linguistic Arithmetic Aggregation Operators in Multiple Attribute Decision Making
In this paper, we investigate the multiple attribute decision making (MADM) problem based on the arithmetic and geometric aggregation operators with hesitant fuzzy linguistic information. Then, motivated by the idea of traditional arithmetic operation, we have developed some aggregation operators for aggregating hesitant fuzzy linguistic information: hesitant fuzzy linguistic weighted average (...
متن کاملLearning Arithmetic Problem Solver
In this paper we describe a problem solving system with a learning mechanism (Learning Arithmetic Problem Solver, LAPS), which can solve arithmetic problems written in natural languages. Since LAPS has knowledge about arithmetic problems in the form of rules, it can solve many different problems without alteration of the program. When LAPS cannot solve a given problem because of a shortage of k...
متن کاملParallelizing Assignment Problem with DNA Strands
Background:Many problems of combinatorial optimization, which are solvable only in exponential time, are known to be Non-Deterministic Polynomial hard (NP-hard). With the advent of parallel machines, new opportunities have been emerged to develop the effective solutions for NP-hard problems. However, solving these problems in polynomial time needs massive parallel machines and ...
متن کاملAn Approach for Solving Traveling Salesman Problem
In this paper, we introduce a new approach for solving the traveling salesman problems (TSP) and provide a solution algorithm for a variant of this problem. The concept of the proposed method is based on the Hungarian algorithm, which has been used to solve an assignment problem for reaching an optimal solution. We introduced a new fittest criterion for crossing over such problems, and illu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009